Attributed Collage Grammars: A Rule-Based Modeling Framework
نویسنده
چکیده
The strength of procedural modeling methods in general and grammar-based modeling in particular lies in their ability to generate visually complex objects and scenes from a comparatively small and simple description. This paper presents attributed collage grammars, a general and versatile modeling method for the generation of scenes. Tree grammars are employed to generate a syntactical description of objects in the form of trees, which are then assigned an actual geometric meaning by an algebra. Complex scenes and objects with a level of detail that would be tedious or impossible to reproduce manually can be constructed from a number of user-defined components which are replicated or transformed by manipulating their attributes through the iterative application of rules.
منابع مشابه
Attributed Context-Sensitive Graph Grammars
The paper introduces a concept of attributed context-sensitive graph grammars. The graph grammars are a graphical generalization of the textual grammars and can thus be used to specify the syntax of graphical programming or modeling languages. The attributed graph grammars extend the basic graph grammars with definitions of attributes and the associated attribute evaluation rules. By analogy to...
متن کاملGeneration of Celtic Key Patterns with Tree-based Collage Grammars
Tree-based collage grammars are a syntactic device for modelling visual languages. Celtic art provides such languages, which follow precise rules of construction, for instance key patterns and knotwork. In this paper, we study the syntactic generation of Celtic key patterns using tree-based collage grammars. Moreover, we compare the regulation mechanisms employed here in order to ensure that on...
متن کاملSome Remarks on the Generative Power of Collage Grammars and Chain-Code Grammars
Collage grammars and context-free chain-code grammars are compared with respect to their generative power. It is shown that the generated classes of line-drawing languages are incomparable, but that chain-code grammars can simulate collage grammars that use only similarity transformations.
متن کاملGenerating Self-Affine Fractals by Collage Grammars
Self-affinity and self-similarity are fundamental concepts in fractal geometry. In this paper, they are related to collage grammars syntactic devices based on hyperedge replacement that generate sets of collages. Essentially, a collage is a picture consisting of geometric parts like line segments, circles, polygons, polyhedra, etc. The overlay of all collages in a collage language yields a frac...
متن کاملCriteria to Disprove Context-Freeness of Collage Languages
Collage grammars generate picture languages in a context-free way. The generating process is based on the replacement of atomic nonterminal items and can be seen as an adaptation of the notion of hyperedge replacement known from the area of context-free graph generation. While a pumping lemma holds for hyperedge replacement graph grammars and is quite useful to show that certain graph languages...
متن کامل